Genetic algorithms applied to scheduling and optimization of refinery operations

نویسندگان

  • F. Oliveira
  • M. R. Almeida
  • S. Hamacher
چکیده

This paper presents a Genetic Algorithm-based method to optimize the production schedule of the fuel oil and asphalt section in a petroleum refinery. Two Genetic Algorithm models were developed to establish the sequence and size of all production shares. A special mutation operator was also proposed to minimize the number of changes in the production. A multi-objective fitness evaluation technique was also incorporated to the Genetic Algorithm models. The obtained results confirm that the proposed Genetic Algorithm models, associated with the multi-objective energy minimization method, are able to solve the scheduling problem, optimizing the refinery’s operational objectives.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

Modelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines

This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

مقایسه و تحلیلی بر استفاده از الگوریتم های فراابتکاری برای حل مسائل زمانبندی تولید کارگاهی

One of the most important problems in research and applied fields of production management is a suitable scheduling for different operations. So, there are many approaches for job workshop or job non-workshop scheduling problems. Since job workshop scheduling problems (JSP) belong to NP-Hard class, some metaheuristics methods such as Tabu Search, Simulated Annealing, Genetic Algorithm and Parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008